L1-Regularized Reconstruction Error as Alpha Matte
نویسندگان
چکیده
منابع مشابه
Sparse codes as Alpha Matte
Matting is a useful tool for image and video editing where foreground objects need to be extracted and pasted onto a different background. A matte is represented by α which defines the opacity of a pixel and is a value in [0, 1], with 0 for background (B) pixels and 1 for foreground (F) pixels. There are three main approaches for image matting: In samplingbased approaches, a foreground-backgrou...
متن کاملImproving alpha matte with depth information
In this paper, we propose an automatic alpha matting method that improves the quality of alpha matte using a depth camera. Depth camera obtains both visual and depth information of moving objects in real time. Our matting method improves existing natural alpha matting methods by adding depth information. Experimental results demonstrate that our matting method generates better results than the ...
متن کاملA dual algorithm for L1-regularized reconstruction of vector fields
Recent advances in vector-field imaging have brought to the forefront the need for efficient denoising and reconstruction algorithms that take the physical properties of vector fields into account and can be applied to large volumes of data. With these requirements in mind, we propose a computationally efficient algorithm for variational denoising and reconstruction of vector fields. Our variat...
متن کاملEfficient L1 Regularized Logistic Regression
L1 regularized logistic regression is now a workhorse of machine learning: it is widely used for many classification problems, particularly ones with many features. L1 regularized logistic regression requires solving a convex optimization problem. However, standard algorithms for solving convex optimization problems do not scale well enough to handle the large datasets encountered in many pract...
متن کاملFast implementation of a l1 - l1 regularized sparse representations algorithm
When seeking a sparse representation of a signal on a redundant basis, one replaces generally the quest for the true sparsest model by an 1 minimization and solves thus a linear program. In the presence of noise one further replaces the exact reconstruction constraint by an approximate one. The 2-norm is generally chosen to measure the reconstruction error because of its link with Gaussian nois...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Signal Processing Letters
سال: 2017
ISSN: 1070-9908,1558-2361
DOI: 10.1109/lsp.2017.2666180